全文获取类型
收费全文 | 124篇 |
免费 | 26篇 |
国内免费 | 11篇 |
出版年
2024年 | 1篇 |
2022年 | 1篇 |
2021年 | 1篇 |
2019年 | 3篇 |
2018年 | 1篇 |
2017年 | 6篇 |
2016年 | 6篇 |
2015年 | 3篇 |
2014年 | 5篇 |
2013年 | 11篇 |
2012年 | 15篇 |
2011年 | 15篇 |
2010年 | 9篇 |
2009年 | 20篇 |
2008年 | 10篇 |
2007年 | 11篇 |
2006年 | 7篇 |
2005年 | 5篇 |
2004年 | 6篇 |
2003年 | 3篇 |
2002年 | 3篇 |
2001年 | 4篇 |
2000年 | 3篇 |
1999年 | 3篇 |
1998年 | 2篇 |
1997年 | 1篇 |
1996年 | 2篇 |
1993年 | 3篇 |
1990年 | 1篇 |
排序方式: 共有161条查询结果,搜索用时 15 毫秒
11.
为了更好适应战时弹药需求的不确定性,必须做好对战时应急保障系统的管理工作,应急弹药储备库的选址问题就是应急保障系统的关键环节.首先依据战时弹药需求特点,从库存策略的角度出发,引入安全库存概念;其次,建立了以建设成本和运输总距离为目标函数的战时应急弹药储备库选址模型;最后,运用Matlab对模型进行了仿真,验证了该模型的有效性. 相似文献
12.
13.
Having a robustly designed supply chain network is one of the most effective ways to hedge against network disruptions because contingency plans in the event of a disruption are often significantly limited. In this article, we study the facility reliability problem: how to design a reliable supply chain network in the presence of random facility disruptions with the option of hardening selected facilities. We consider a facility location problem incorporating two types of facilities, one that is unreliable and another that is reliable (which is not subject to disruption, but is more expensive). We formulate this as a mixed integer programming model and develop a Lagrangian Relaxation‐based solution algorithm. We derive structural properties of the problem and show that for some values of the disruption probability, the problem reduces to the classical uncapacitated fixed charge location problem. In addition, we show that the proposed solution algorithm is not only capable of solving large‐scale problems, but is also computationally effective. © 2009 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
14.
We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010 相似文献
15.
16.
17.
针对基于位置时间参数解析算法的声纳浮标阵搜潜系统的定位精度问题,采用定性和定量分析相结合的方法展开了研究。从解析定位模型出发,首先定性分析浮标自身的定位误差与传感器测时误差对航速及航向角计算的影响;然后选取评价指标,采用蒙特卡洛方法进行了仿真分析,得到了不同仿真条件下各个因素对定位精度具体的影响关系,这些结论为根据精度参数合理选择浮标阵的数量及布放阵型提供了依据。 相似文献
18.
地空导弹部队在防空作战中,导弹火力单元要按上级的命令适时机动,需要对所在位置进行精确定位并及时上报上级单位,以便尽快组成新的雷达网继续参加战斗。根据GPS测距和差分GPS定位原理,利用载波相位差分设备把采集的载波相位发送给用户站进行求差解算坐标,得到机动作战导弹火力单元的位置坐标。根据载波相位差分定位GPS载波相位差分接收机技术成熟,成本不高,适合机动作战导弹部队应用。通过编制相应的模型软件,以及加入通信接口,便可用于导弹火力单元雷达站址的快速定位。 相似文献
19.
提出了一种新颖简单的虹膜内边缘(瞳孔)定位算法.此算法分别对虹膜图像的每一行进行处理.首先,采用一种简单的齿形变换对虹膜图像每一行的灰度曲线进行变换,变换后的灰度曲线为齿形并且虹膜内边缘点出现在齿形曲线的转折点处.然后,根据在虹膜内边缘点处齿形灰度曲线的斜率由负值变为正值的特点,检测虹膜内边缘点并定位虹膜内边缘的位置.此算法具有新颖、简单、准确和速度快等特点. 相似文献
20.